Multisets and inequalities
نویسندگان
چکیده
منابع مشابه
Priority Queues and Multisets
A priority queue, a container data structure equipped with the operations insert and delete-minimum, can re-order its input in various ways, depending both on the input and on the sequence of operations used. If a given input σ can produce a particular output τ then (σ, τ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in one-to-one correspondence with...
متن کاملNested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL
We present a collection of formalized results about finite nested multisets, developed using the Isabelle/HOL proof assistant. The nested multiset order is a generalization of the multiset order that can be used to prove termination of processes. Hereditary multisets, a variant of nested multisets, offer a convenient representation of ordinals below 0. In Isabelle/HOL, both nested and hereditar...
متن کاملFormalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals
This Isabelle/HOL formalization introduces a nested multiset datatype and de nes Dershowitz and Manna's nested multiset order. The order is proved well founded and linear. By removing one constructor, we transform the nested multisets into hereditary multisets. These are isomorphic to the syntactic ordinals the ordinals can be recursively expressed in Cantor normal form. Addition, subtraction, ...
متن کاملMultisets and Fuzzy Multisets as a Framework of Information Systems
Multisets are now a common tool and a fundamental framework in information processing. Their generalization to fuzzy multisets has also been studied. In this paper the basics of multisets and fuzzy multisets are reviewed, fundamental properties of fuzzy multisets are proved, and advanced operations are defined. Applications to rough sets, fuzzy data retrieval, and automatic classification are m...
متن کاملRandomized Sets and Multisets
Sets and multisets are fundamental data structures which are used in numerous distributed algorithms. We investigate randomized versions of sets and multisets and show that our probabilistic approach can improve the performance of systems using our distributed shared data structures. We give algorithms for basic set and multiset operations and prove a number of fundamental properties. We illust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science World Journal
سال: 2010
ISSN: 1597-6343
DOI: 10.4314/swj.v2i2.51732